Communication Complexity (for Algorithm Designers) Tim Roughgarden c Tim Roughgarden 2015

Source URL: theory.stanford.edu

Communication Complexity of Learning Discrete Distributions Krzysztof Onak IBM T.J. Watson Research Center Joint work with Ilias Diakonikolas,

Source URL: dimacs.rutgers.edu

Nerlich, Brigitte and Koteyko, NelyaCompounds, creativity and complexity in climate change communication: the case of ‘carbon indulgences’. Global Environmental Change, ppISSNAcce

Source URL: eprints.nottingham.ac.uk

Turn complexity in to value Orchestration of multi-channel communication Egon Wilcsek VP Global Sales

Source URL: www.internetworld-messe.de

VOLUME 83, NUMBER 9 PHYSICAL REVIEW LETTERS 30 AUGUST 1999

Source URL: cqi.inf.usi.ch

• Quantum mechanics
• Quantum information science
• Theoretical computer science
• Physics
• Bell state
• No-communication theorem
• Quantum entanglement
• Qubit
• Communication complexity
• Quantum information
• Measurement in quantum mechanics

MANAGING COMPLEXITY IN MODERN SOCIETAL-SYSTEMS: VOLUMES 1 & 2 Monty G. Marshall (Author/Producer); Eliot Elzinga (Videographer) Vienna, VA: Center for Systemic Peace, www.systemicpeace.org/videobook.html Table

Source URL: www.systemicpeace.org

• Behavior
• Group development
• Human communication
• Social work
• Governance
• Violence

Lower bounds in models other than communication complexity: Turing machines, branching programs, span programs, decision trees, Boolean circuits, property testing April 12, 2014

Source URL: people.cs.uchicago.edu

• Combinatorica
• Communication complexity
• Academia
• Computer science

Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk

Source URL: cs-www.cs.yale.edu

• Cryptography
• Mathematical analysis
• Quantum complexity theory
• Computational complexity theory
• Functions and mappings
• Secure multi-party computation
• Communication complexity
• Secure two-party computation
• Limit of a function
• Cryptographic protocol
• Pi
• PP

A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

Source URL: www.cs.huji.ac.il

• Mathematics
• Algebra
• Computational complexity theory
• Analysis of algorithms
• Multiplication
• Numerical linear algebra
• Matrix multiplication algorithm
• Matrix multiplication
• Strassen algorithm
• Fast Fourier transform
• Multiplication algorithm
• Algorithm

Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †

Source URL: www.cs.huji.ac.il

• Graph theory
• Mathematics
• Combinatorial optimization
• Edsger W. Dijkstra
• Matrix multiplication algorithm
• NP-complete problems
• Matching
• Routing algorithms
• Computational complexity theory
• Connected component
• Dynamic programming
• Graph coloring